package hypergraph;

public class Node implements Comparable<Node>{
	protected static int NEXT_ID = 0;
	int id;
	
	
	
	public Node(){
		id = NEXT_ID;
		NEXT_ID++;
	}
	
	public int hashCode(){
		return id;
	}

	public int compareTo(Node o) {
		return o.id - id;
	}

	public void print() {
		System.out.println("N"+id);
	}
	
	public Node clone(){
		return new Node();
	}
}
